The expected profile of digital search trees
نویسندگان
چکیده
منابع مشابه
The expected profile of digital search trees
A digital search tree (DST) is a fundamental data structure on words that finds various applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. The profile of a DST measures the number of nodes at the same distance from the root; it depends on the number of stored strings and the distance from the root. Most parameters of DST (e.g., depth, height, fillup)...
متن کاملThe Expected Profile of Digital Search Trees ∗ December 10 , 2009
A digital search tree (DST) is a fundamental data structure on words that finds myriad of applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. It is a digital tree in which strings (keys, words) are stored directly in (internal) nodes. The profile of a DST measures the number of nodes at the same distance from the root; it is a function of the number o...
متن کاملThe Expected Profile of Digital Search Trees ∗ March 24 , 2011
A digital search tree (DST) is a fundamental data structure on words that finds various applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. The profile of a DST measures the number of nodes at the same distance from the root; it depends on the number of stored strings and the distance from the root. Most parameters of DST (e.g., depth, height, fillup)...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملExternal Profile of Symmetric Digital Search Trees
The external profile is among the first examined shape parameters of digital search trees in connection with the performance of unsuccessful search of a random query in the early 1970s. However, finer and important properties beyond the mean such as the variance and the limit law have remained unknown. In this extended abstract, we describe the first results for the asymptotic variance and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2011
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2011.04.001